The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

from(X) → cons(X, from(s(X)))
2ndspos(0, Z) → rnil
2ndspos(s(N), cons(X, cons(Y, Z))) → rcons(posrecip(Y), 2ndsneg(N, Z))
2ndsneg(0, Z) → rnil
2ndsneg(s(N), cons(X, cons(Y, Z))) → rcons(negrecip(Y), 2ndspos(N, Z))
pi(X) → 2ndspos(X, from(0))
plus(0, Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0, Y) → 0
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)

Rewrite Strategy: FULL

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

from(X) → cons(X, from(s(X)))
2ndspos(0', Z) → rnil
2ndspos(s(N), cons(X, cons(Y, Z))) → rcons(posrecip(Y), 2ndsneg(N, Z))
2ndsneg(0', Z) → rnil
2ndsneg(s(N), cons(X, cons(Y, Z))) → rcons(negrecip(Y), 2ndspos(N, Z))
pi(X) → 2ndspos(X, from(0'))
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0', Y) → 0'
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)

S is empty.
Rewrite Strategy: FULL

(3) SlicingProof (LOWER BOUND(ID) transformation)

Sliced the following arguments:
from/0
cons/0
rcons/0
posrecip/0
negrecip/0

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

from → cons(from)
2ndspos(0', Z) → rnil
2ndspos(s(N), cons(cons(Z))) → rcons(2ndsneg(N, Z))
2ndsneg(0', Z) → rnil
2ndsneg(s(N), cons(cons(Z))) → rcons(2ndspos(N, Z))
pi(X) → 2ndspos(X, from)
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0', Y) → 0'
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
from → cons(from)
2ndspos(0', Z) → rnil
2ndspos(s(N), cons(cons(Z))) → rcons(2ndsneg(N, Z))
2ndsneg(0', Z) → rnil
2ndsneg(s(N), cons(cons(Z))) → rcons(2ndspos(N, Z))
pi(X) → 2ndspos(X, from)
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0', Y) → 0'
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)

Types:
from :: cons
cons :: cons → cons
2ndspos :: 0':s → cons → rnil:rcons
0' :: 0':s
rnil :: rnil:rcons
s :: 0':s → 0':s
rcons :: rnil:rcons → rnil:rcons
2ndsneg :: 0':s → cons → rnil:rcons
pi :: 0':s → rnil:rcons
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
square :: 0':s → 0':s
hole_cons1_0 :: cons
hole_rnil:rcons2_0 :: rnil:rcons
hole_0':s3_0 :: 0':s
gen_cons4_0 :: Nat → cons
gen_rnil:rcons5_0 :: Nat → rnil:rcons
gen_0':s6_0 :: Nat → 0':s

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
from, 2ndspos, 2ndsneg, plus, times

They will be analysed ascendingly in the following order:
2ndspos = 2ndsneg
plus < times

(8) Obligation:

TRS:
Rules:
from → cons(from)
2ndspos(0', Z) → rnil
2ndspos(s(N), cons(cons(Z))) → rcons(2ndsneg(N, Z))
2ndsneg(0', Z) → rnil
2ndsneg(s(N), cons(cons(Z))) → rcons(2ndspos(N, Z))
pi(X) → 2ndspos(X, from)
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0', Y) → 0'
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)

Types:
from :: cons
cons :: cons → cons
2ndspos :: 0':s → cons → rnil:rcons
0' :: 0':s
rnil :: rnil:rcons
s :: 0':s → 0':s
rcons :: rnil:rcons → rnil:rcons
2ndsneg :: 0':s → cons → rnil:rcons
pi :: 0':s → rnil:rcons
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
square :: 0':s → 0':s
hole_cons1_0 :: cons
hole_rnil:rcons2_0 :: rnil:rcons
hole_0':s3_0 :: 0':s
gen_cons4_0 :: Nat → cons
gen_rnil:rcons5_0 :: Nat → rnil:rcons
gen_0':s6_0 :: Nat → 0':s

Generator Equations:
gen_cons4_0(0) ⇔ hole_cons1_0
gen_cons4_0(+(x, 1)) ⇔ cons(gen_cons4_0(x))
gen_rnil:rcons5_0(0) ⇔ rnil
gen_rnil:rcons5_0(+(x, 1)) ⇔ rcons(gen_rnil:rcons5_0(x))
gen_0':s6_0(0) ⇔ 0'
gen_0':s6_0(+(x, 1)) ⇔ s(gen_0':s6_0(x))

The following defined symbols remain to be analysed:
from, 2ndspos, 2ndsneg, plus, times

They will be analysed ascendingly in the following order:
2ndspos = 2ndsneg
plus < times

(9) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol from.

(10) Obligation:

TRS:
Rules:
from → cons(from)
2ndspos(0', Z) → rnil
2ndspos(s(N), cons(cons(Z))) → rcons(2ndsneg(N, Z))
2ndsneg(0', Z) → rnil
2ndsneg(s(N), cons(cons(Z))) → rcons(2ndspos(N, Z))
pi(X) → 2ndspos(X, from)
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0', Y) → 0'
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)

Types:
from :: cons
cons :: cons → cons
2ndspos :: 0':s → cons → rnil:rcons
0' :: 0':s
rnil :: rnil:rcons
s :: 0':s → 0':s
rcons :: rnil:rcons → rnil:rcons
2ndsneg :: 0':s → cons → rnil:rcons
pi :: 0':s → rnil:rcons
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
square :: 0':s → 0':s
hole_cons1_0 :: cons
hole_rnil:rcons2_0 :: rnil:rcons
hole_0':s3_0 :: 0':s
gen_cons4_0 :: Nat → cons
gen_rnil:rcons5_0 :: Nat → rnil:rcons
gen_0':s6_0 :: Nat → 0':s

Generator Equations:
gen_cons4_0(0) ⇔ hole_cons1_0
gen_cons4_0(+(x, 1)) ⇔ cons(gen_cons4_0(x))
gen_rnil:rcons5_0(0) ⇔ rnil
gen_rnil:rcons5_0(+(x, 1)) ⇔ rcons(gen_rnil:rcons5_0(x))
gen_0':s6_0(0) ⇔ 0'
gen_0':s6_0(+(x, 1)) ⇔ s(gen_0':s6_0(x))

The following defined symbols remain to be analysed:
plus, 2ndspos, 2ndsneg, times

They will be analysed ascendingly in the following order:
2ndspos = 2ndsneg
plus < times

(11) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
plus(gen_0':s6_0(n11_0), gen_0':s6_0(b)) → gen_0':s6_0(+(n11_0, b)), rt ∈ Ω(1 + n11₀)

Induction Base:
plus(gen_0':s6_0(0), gen_0':s6_0(b)) →_R^Ω(1)
gen_0':s6_0(b)

Induction Step:
plus(gen_0':s6_0(+(n11_0, 1)), gen_0':s6_0(b)) →_R^Ω(1)
s(plus(gen_0':s6_0(n11_0), gen_0':s6_0(b))) →_IH
s(gen_0':s6_0(+(b, c12_0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(12) Complex Obligation (BEST)

(13) Obligation:

TRS:
Rules:
from → cons(from)
2ndspos(0', Z) → rnil
2ndspos(s(N), cons(cons(Z))) → rcons(2ndsneg(N, Z))
2ndsneg(0', Z) → rnil
2ndsneg(s(N), cons(cons(Z))) → rcons(2ndspos(N, Z))
pi(X) → 2ndspos(X, from)
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0', Y) → 0'
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)

Types:
from :: cons
cons :: cons → cons
2ndspos :: 0':s → cons → rnil:rcons
0' :: 0':s
rnil :: rnil:rcons
s :: 0':s → 0':s
rcons :: rnil:rcons → rnil:rcons
2ndsneg :: 0':s → cons → rnil:rcons
pi :: 0':s → rnil:rcons
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
square :: 0':s → 0':s
hole_cons1_0 :: cons
hole_rnil:rcons2_0 :: rnil:rcons
hole_0':s3_0 :: 0':s
gen_cons4_0 :: Nat → cons
gen_rnil:rcons5_0 :: Nat → rnil:rcons
gen_0':s6_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s6_0(n11_0), gen_0':s6_0(b)) → gen_0':s6_0(+(n11_0, b)), rt ∈ Ω(1 + n11₀)

Generator Equations:
gen_cons4_0(0) ⇔ hole_cons1_0
gen_cons4_0(+(x, 1)) ⇔ cons(gen_cons4_0(x))
gen_rnil:rcons5_0(0) ⇔ rnil
gen_rnil:rcons5_0(+(x, 1)) ⇔ rcons(gen_rnil:rcons5_0(x))
gen_0':s6_0(0) ⇔ 0'
gen_0':s6_0(+(x, 1)) ⇔ s(gen_0':s6_0(x))

The following defined symbols remain to be analysed:
times, 2ndspos, 2ndsneg

They will be analysed ascendingly in the following order:
2ndspos = 2ndsneg

(14) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
times(gen_0':s6_0(n940_0), gen_0':s6_0(b)) → gen_0':s6_0(*(n940_0, b)), rt ∈ Ω(1 + b·n940₀ + n940₀)

Induction Base:
times(gen_0':s6_0(0), gen_0':s6_0(b)) →_R^Ω(1)
0'

Induction Step:
times(gen_0':s6_0(+(n940_0, 1)), gen_0':s6_0(b)) →_R^Ω(1)
plus(gen_0':s6_0(b), times(gen_0':s6_0(n940_0), gen_0':s6_0(b))) →_IH
plus(gen_0':s6_0(b), gen_0':s6_0(*(c941_0, b))) →_L^{Ω(1 + b)}
gen_0':s6_0(+(b, *(n940_0, b)))

We have rt ∈ Ω(n²) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n²).

(15) Complex Obligation (BEST)

(16) Obligation:

TRS:
Rules:
from → cons(from)
2ndspos(0', Z) → rnil
2ndspos(s(N), cons(cons(Z))) → rcons(2ndsneg(N, Z))
2ndsneg(0', Z) → rnil
2ndsneg(s(N), cons(cons(Z))) → rcons(2ndspos(N, Z))
pi(X) → 2ndspos(X, from)
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0', Y) → 0'
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)

Types:
from :: cons
cons :: cons → cons
2ndspos :: 0':s → cons → rnil:rcons
0' :: 0':s
rnil :: rnil:rcons
s :: 0':s → 0':s
rcons :: rnil:rcons → rnil:rcons
2ndsneg :: 0':s → cons → rnil:rcons
pi :: 0':s → rnil:rcons
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
square :: 0':s → 0':s
hole_cons1_0 :: cons
hole_rnil:rcons2_0 :: rnil:rcons
hole_0':s3_0 :: 0':s
gen_cons4_0 :: Nat → cons
gen_rnil:rcons5_0 :: Nat → rnil:rcons
gen_0':s6_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s6_0(n11_0), gen_0':s6_0(b)) → gen_0':s6_0(+(n11_0, b)), rt ∈ Ω(1 + n11₀)
times(gen_0':s6_0(n940_0), gen_0':s6_0(b)) → gen_0':s6_0(*(n940_0, b)), rt ∈ Ω(1 + b·n940₀ + n940₀)

Generator Equations:
gen_cons4_0(0) ⇔ hole_cons1_0
gen_cons4_0(+(x, 1)) ⇔ cons(gen_cons4_0(x))
gen_rnil:rcons5_0(0) ⇔ rnil
gen_rnil:rcons5_0(+(x, 1)) ⇔ rcons(gen_rnil:rcons5_0(x))
gen_0':s6_0(0) ⇔ 0'
gen_0':s6_0(+(x, 1)) ⇔ s(gen_0':s6_0(x))

The following defined symbols remain to be analysed:
2ndsneg, 2ndspos

They will be analysed ascendingly in the following order:
2ndspos = 2ndsneg

(17) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
2ndsneg(gen_0':s6_0(*(2, n1908_0)), gen_cons4_0(*(4, n1908_0))) → gen_rnil:rcons5_0(*(2, n1908_0)), rt ∈ Ω(1 + n1908₀)

Induction Base:
2ndsneg(gen_0':s6_0(*(2, 0)), gen_cons4_0(*(4, 0))) →_R^Ω(1)
rnil

Induction Step:
2ndsneg(gen_0':s6_0(*(2, +(n1908_0, 1))), gen_cons4_0(*(4, +(n1908_0, 1)))) →_R^Ω(1)
rcons(2ndspos(gen_0':s6_0(+(1, *(2, n1908_0))), gen_cons4_0(+(2, *(4, n1908_0))))) →_R^Ω(1)
rcons(rcons(2ndsneg(gen_0':s6_0(*(2, n1908_0)), gen_cons4_0(*(4, n1908_0))))) →_IH
rcons(rcons(gen_rnil:rcons5_0(*(2, c1909_0))))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(18) Complex Obligation (BEST)

(19) Obligation:

TRS:
Rules:
from → cons(from)
2ndspos(0', Z) → rnil
2ndspos(s(N), cons(cons(Z))) → rcons(2ndsneg(N, Z))
2ndsneg(0', Z) → rnil
2ndsneg(s(N), cons(cons(Z))) → rcons(2ndspos(N, Z))
pi(X) → 2ndspos(X, from)
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0', Y) → 0'
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)

Types:
from :: cons
cons :: cons → cons
2ndspos :: 0':s → cons → rnil:rcons
0' :: 0':s
rnil :: rnil:rcons
s :: 0':s → 0':s
rcons :: rnil:rcons → rnil:rcons
2ndsneg :: 0':s → cons → rnil:rcons
pi :: 0':s → rnil:rcons
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
square :: 0':s → 0':s
hole_cons1_0 :: cons
hole_rnil:rcons2_0 :: rnil:rcons
hole_0':s3_0 :: 0':s
gen_cons4_0 :: Nat → cons
gen_rnil:rcons5_0 :: Nat → rnil:rcons
gen_0':s6_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s6_0(n11_0), gen_0':s6_0(b)) → gen_0':s6_0(+(n11_0, b)), rt ∈ Ω(1 + n11₀)
times(gen_0':s6_0(n940_0), gen_0':s6_0(b)) → gen_0':s6_0(*(n940_0, b)), rt ∈ Ω(1 + b·n940₀ + n940₀)
2ndsneg(gen_0':s6_0(*(2, n1908_0)), gen_cons4_0(*(4, n1908_0))) → gen_rnil:rcons5_0(*(2, n1908_0)), rt ∈ Ω(1 + n1908₀)

Generator Equations:
gen_cons4_0(0) ⇔ hole_cons1_0
gen_cons4_0(+(x, 1)) ⇔ cons(gen_cons4_0(x))
gen_rnil:rcons5_0(0) ⇔ rnil
gen_rnil:rcons5_0(+(x, 1)) ⇔ rcons(gen_rnil:rcons5_0(x))
gen_0':s6_0(0) ⇔ 0'
gen_0':s6_0(+(x, 1)) ⇔ s(gen_0':s6_0(x))

The following defined symbols remain to be analysed:
2ndspos

They will be analysed ascendingly in the following order:
2ndspos = 2ndsneg

(20) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol 2ndspos.

(21) Obligation:

TRS:
Rules:
from → cons(from)
2ndspos(0', Z) → rnil
2ndspos(s(N), cons(cons(Z))) → rcons(2ndsneg(N, Z))
2ndsneg(0', Z) → rnil
2ndsneg(s(N), cons(cons(Z))) → rcons(2ndspos(N, Z))
pi(X) → 2ndspos(X, from)
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0', Y) → 0'
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)

Types:
from :: cons
cons :: cons → cons
2ndspos :: 0':s → cons → rnil:rcons
0' :: 0':s
rnil :: rnil:rcons
s :: 0':s → 0':s
rcons :: rnil:rcons → rnil:rcons
2ndsneg :: 0':s → cons → rnil:rcons
pi :: 0':s → rnil:rcons
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
square :: 0':s → 0':s
hole_cons1_0 :: cons
hole_rnil:rcons2_0 :: rnil:rcons
hole_0':s3_0 :: 0':s
gen_cons4_0 :: Nat → cons
gen_rnil:rcons5_0 :: Nat → rnil:rcons
gen_0':s6_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s6_0(n11_0), gen_0':s6_0(b)) → gen_0':s6_0(+(n11_0, b)), rt ∈ Ω(1 + n11₀)
times(gen_0':s6_0(n940_0), gen_0':s6_0(b)) → gen_0':s6_0(*(n940_0, b)), rt ∈ Ω(1 + b·n940₀ + n940₀)
2ndsneg(gen_0':s6_0(*(2, n1908_0)), gen_cons4_0(*(4, n1908_0))) → gen_rnil:rcons5_0(*(2, n1908_0)), rt ∈ Ω(1 + n1908₀)

Generator Equations:
gen_cons4_0(0) ⇔ hole_cons1_0
gen_cons4_0(+(x, 1)) ⇔ cons(gen_cons4_0(x))
gen_rnil:rcons5_0(0) ⇔ rnil
gen_rnil:rcons5_0(+(x, 1)) ⇔ rcons(gen_rnil:rcons5_0(x))
gen_0':s6_0(0) ⇔ 0'
gen_0':s6_0(+(x, 1)) ⇔ s(gen_0':s6_0(x))

No more defined symbols left to analyse.

(22) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
times(gen_0':s6_0(n940_0), gen_0':s6_0(b)) → gen_0':s6_0(*(n940_0, b)), rt ∈ Ω(1 + b·n940₀ + n940₀)

(23) BOUNDS(n^2, INF)

(24) Obligation:

TRS:
Rules:
from → cons(from)
2ndspos(0', Z) → rnil
2ndspos(s(N), cons(cons(Z))) → rcons(2ndsneg(N, Z))
2ndsneg(0', Z) → rnil
2ndsneg(s(N), cons(cons(Z))) → rcons(2ndspos(N, Z))
pi(X) → 2ndspos(X, from)
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0', Y) → 0'
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)

Types:
from :: cons
cons :: cons → cons
2ndspos :: 0':s → cons → rnil:rcons
0' :: 0':s
rnil :: rnil:rcons
s :: 0':s → 0':s
rcons :: rnil:rcons → rnil:rcons
2ndsneg :: 0':s → cons → rnil:rcons
pi :: 0':s → rnil:rcons
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
square :: 0':s → 0':s
hole_cons1_0 :: cons
hole_rnil:rcons2_0 :: rnil:rcons
hole_0':s3_0 :: 0':s
gen_cons4_0 :: Nat → cons
gen_rnil:rcons5_0 :: Nat → rnil:rcons
gen_0':s6_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s6_0(n11_0), gen_0':s6_0(b)) → gen_0':s6_0(+(n11_0, b)), rt ∈ Ω(1 + n11₀)
times(gen_0':s6_0(n940_0), gen_0':s6_0(b)) → gen_0':s6_0(*(n940_0, b)), rt ∈ Ω(1 + b·n940₀ + n940₀)
2ndsneg(gen_0':s6_0(*(2, n1908_0)), gen_cons4_0(*(4, n1908_0))) → gen_rnil:rcons5_0(*(2, n1908_0)), rt ∈ Ω(1 + n1908₀)

Generator Equations:
gen_cons4_0(0) ⇔ hole_cons1_0
gen_cons4_0(+(x, 1)) ⇔ cons(gen_cons4_0(x))
gen_rnil:rcons5_0(0) ⇔ rnil
gen_rnil:rcons5_0(+(x, 1)) ⇔ rcons(gen_rnil:rcons5_0(x))
gen_0':s6_0(0) ⇔ 0'
gen_0':s6_0(+(x, 1)) ⇔ s(gen_0':s6_0(x))

No more defined symbols left to analyse.

(25) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
times(gen_0':s6_0(n940_0), gen_0':s6_0(b)) → gen_0':s6_0(*(n940_0, b)), rt ∈ Ω(1 + b·n940₀ + n940₀)

(26) BOUNDS(n^2, INF)

(27) Obligation:

TRS:
Rules:
from → cons(from)
2ndspos(0', Z) → rnil
2ndspos(s(N), cons(cons(Z))) → rcons(2ndsneg(N, Z))
2ndsneg(0', Z) → rnil
2ndsneg(s(N), cons(cons(Z))) → rcons(2ndspos(N, Z))
pi(X) → 2ndspos(X, from)
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0', Y) → 0'
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)

Types:
from :: cons
cons :: cons → cons
2ndspos :: 0':s → cons → rnil:rcons
0' :: 0':s
rnil :: rnil:rcons
s :: 0':s → 0':s
rcons :: rnil:rcons → rnil:rcons
2ndsneg :: 0':s → cons → rnil:rcons
pi :: 0':s → rnil:rcons
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
square :: 0':s → 0':s
hole_cons1_0 :: cons
hole_rnil:rcons2_0 :: rnil:rcons
hole_0':s3_0 :: 0':s
gen_cons4_0 :: Nat → cons
gen_rnil:rcons5_0 :: Nat → rnil:rcons
gen_0':s6_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s6_0(n11_0), gen_0':s6_0(b)) → gen_0':s6_0(+(n11_0, b)), rt ∈ Ω(1 + n11₀)
times(gen_0':s6_0(n940_0), gen_0':s6_0(b)) → gen_0':s6_0(*(n940_0, b)), rt ∈ Ω(1 + b·n940₀ + n940₀)

Generator Equations:
gen_cons4_0(0) ⇔ hole_cons1_0
gen_cons4_0(+(x, 1)) ⇔ cons(gen_cons4_0(x))
gen_rnil:rcons5_0(0) ⇔ rnil
gen_rnil:rcons5_0(+(x, 1)) ⇔ rcons(gen_rnil:rcons5_0(x))
gen_0':s6_0(0) ⇔ 0'
gen_0':s6_0(+(x, 1)) ⇔ s(gen_0':s6_0(x))

No more defined symbols left to analyse.

(28) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
times(gen_0':s6_0(n940_0), gen_0':s6_0(b)) → gen_0':s6_0(*(n940_0, b)), rt ∈ Ω(1 + b·n940₀ + n940₀)

(29) BOUNDS(n^2, INF)

(30) Obligation:

TRS:
Rules:
from → cons(from)
2ndspos(0', Z) → rnil
2ndspos(s(N), cons(cons(Z))) → rcons(2ndsneg(N, Z))
2ndsneg(0', Z) → rnil
2ndsneg(s(N), cons(cons(Z))) → rcons(2ndspos(N, Z))
pi(X) → 2ndspos(X, from)
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0', Y) → 0'
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)

Types:
from :: cons
cons :: cons → cons
2ndspos :: 0':s → cons → rnil:rcons
0' :: 0':s
rnil :: rnil:rcons
s :: 0':s → 0':s
rcons :: rnil:rcons → rnil:rcons
2ndsneg :: 0':s → cons → rnil:rcons
pi :: 0':s → rnil:rcons
plus :: 0':s → 0':s → 0':s
times :: 0':s → 0':s → 0':s
square :: 0':s → 0':s
hole_cons1_0 :: cons
hole_rnil:rcons2_0 :: rnil:rcons
hole_0':s3_0 :: 0':s
gen_cons4_0 :: Nat → cons
gen_rnil:rcons5_0 :: Nat → rnil:rcons
gen_0':s6_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s6_0(n11_0), gen_0':s6_0(b)) → gen_0':s6_0(+(n11_0, b)), rt ∈ Ω(1 + n11₀)

Generator Equations:
gen_cons4_0(0) ⇔ hole_cons1_0
gen_cons4_0(+(x, 1)) ⇔ cons(gen_cons4_0(x))
gen_rnil:rcons5_0(0) ⇔ rnil
gen_rnil:rcons5_0(+(x, 1)) ⇔ rcons(gen_rnil:rcons5_0(x))
gen_0':s6_0(0) ⇔ 0'
gen_0':s6_0(+(x, 1)) ⇔ s(gen_0':s6_0(x))

No more defined symbols left to analyse.

(31) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
plus(gen_0':s6_0(n11_0), gen_0':s6_0(b)) → gen_0':s6_0(+(n11_0, b)), rt ∈ Ω(1 + n11₀)

(32) BOUNDS(n^1, INF)